Tolerance graphs
نویسندگان
چکیده
Tolerance graphs arise from the intersection of intervals with varying tolerances in a way that generalizes both interval graphs and permutation graphs. In this paper we prove that every tolerance graph is perfect by demonstrating that its complement is perfectly orderable. We show that a tolerance graph cannot contain a chordless cycle of length greater than or equal to 5 nor the complement of one. We also discuss the subclasses of bounded tolerance graphs, proper tolerance graphs, and unit tolerance graphs and present several possible applications and open questions.
منابع مشابه
Relating threshold tolerance graphs to other graph classes
A graph G = (V, E) is a threshold tolerance if it is possible to associate weights and tolerances with each node of G so that two nodes are adjacent exactly when the sum of their weights exceeds either one of their tolerances. Threshold tolerance graphs are a special case of the well-known class of tolerance graphs and generalize the class of threshold graphs which are also extensively studied ...
متن کامل- tolerance chain graphs
Jacobson, MS., J. Lehel and L.M. Lesniak, @threshold and $-tolerance chain graphs, Discrete Applied Mathematics 44 (1993) 191-203. In this paper we introduce a class of graphs called $-threshold graphs which generalize threshold graphs. These graphs are studied for various functions I+? that include “max” and “min” as special cases. The graphs are then shown to fit into the more general setting...
متن کاملThe Recognition of Tolerance and Bounded Tolerance Graphs
Tolerance graphs model interval relations in such a way that intervals can tolerate a certain degree of overlap without being in conflict. This subclass of perfect graphs has been extensively studied, due to both its interesting structure and its numerous applications. Several efficient algorithms for optimization problems that are NP-hard on general graphs have been designed for tolerance grap...
متن کاملDomination in bounded interval tolerance graphs
In this paper we present eÆcient algorithms to solve domination set problem for the class of bounded tolerance graphs. The class of bounded tolerance graphs includes interval graphs and permtation graph as subclasses. Our solution to domination set problem has improved bounds for time complexity than the algorithm for the general co-comparability graphs which can as well be used for bounded tol...
متن کاملTriangle Graphs and Simple Trapezoid Graphs
In the literature of graph recognition algorithms, two of the most extensively covered graphs are interval graphs and permutation graphs [6, 2]. One way of generalizing both interval graphs and permutation graphs is the intersection graph of a collection of trapezoids with corner points lying on two parallel lines. Such a graph is called the trapezoid graph [3, 4]; Ma and Spinrad [8] show that ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Applied Mathematics
دوره 9 شماره
صفحات -
تاریخ انتشار 1984